Searching and Pebbling
نویسندگان
چکیده
We relate the search number of an undirected graph G with the minimum and maximum of the progressive pebble demands of the directed acyclic graphs obtained by orienting (7. Towards this end, we introduce node-searching, a slight variant of searching, in which an edge is cleared by placing searchers on both of its endpoints. We also show that the minimum number of searchers necessary to node-search a graph equals its vertex separator plus one.
منابع مشابه
Optimal pebbling in products of graphs
We prove a generalization of Graham’s Conjecture for optimal pebbling with arbitrary sets of target distributions. We provide bounds on optimal pebbling numbers of products of complete graphs and explicitly find optimal t-pebbling numbers for specific such products. We obtain bounds on optimal pebbling numbers of powers of the cycle C5. Finally, we present explicit distributions which provide a...
متن کاملA Graph Pebbling Algorithm on Weighted Graphs
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number m needed to guarante...
متن کاملThe Complexity of Pebbling and Cover Pebbling
This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition or the cover pebbling definition is shown to be NP -complete. The problem of determining the cover pebbling number for an arbitrary demand configuration is ...
متن کاملDomination Cover Pebbling: Structural Results
This paper continues the results of “Domination Cover Pebbling: Graph Families.” An almost sharp bound for the domination cover pebbling (DCP) number, ψ(G), for graphs G with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between λ(G), the cover pebbling number of G, and ψ(G) has been computed. A variant of domination cover pebbling, called subversion DC...
متن کاملThe Optimal Pebbling Number of the Caterpillar
Let G be a simple graph. If we place p pebbles on the vertices of G, then a pebbling move is taking two pebbles off one vertex and then placing one on an adjacent vertex. The optimal pebbling number of G, f ′(G), is the least positive integer p such that p pebbles are placed suitably on vertices of G and for any target vertex v of G, we can move one pebble to v by a sequence of pebbling moves. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 47 شماره
صفحات -
تاریخ انتشار 1986